Several-Tokens Distributed Mutual Exclusion Algorithm in a Logical Ring Network
نویسنده
چکیده
A mutual distributed algorithm on a token ring is proposed in this paper. The proposed algorithm is based on the token ring approach and allows simultaneous existence of several tokens in the logical ring of the network. Each process generates a unique token and sends it as request to enter the critical section that travels along the ring. The process can only enter the critical section if it gets back its own token. The proposed algorithm also handles the coincident existence of multiple critical sections (if any) in the system.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملAn Efficient K-Mutual Exclusion Algorithm Using a New Token Passing Strategy
This paper addresses the issue of K-mutual exclusion in a distributed system. Our proposed algorithm divides a network into root nodes and regular nodes. The root nodes communicate with each other via a ring network and communicate directly with a set of regular nodes that they are assigned to. Mutual exclusion is achieved by using k tokens that are maintained by the root nodes, the collaborati...
متن کاملA Distributed Deadlock Free Quorum Based Algorithm for Mutual Exclusion
Quorum-based mutual exclusion algorithms enjoy many advantages such as low message complexity and high failure resiliency. The use of quorums is a well-known approach to achieving mutual exclusion in distributed environments. Several distributed based quorum mutual exclusion was presented. The number of messages required by these algorithms require between 3 and 5 , where n is the size of under...
متن کاملSelf-Stabilizing Mutual Exclusion Using Tokens in Mobile Ad Hoc Network
In this paper, we propose a self-stabilizing mutual exclusion algorithm using tokens for the mobile ad hoc network. Since the liveness condition of mutual exclusion can’t be guaranteed by any algorithm for a mobile ad hoc network with arbitary mobility, we consider a mobile ad hoc network with restricted mobility. Our algorithm is based on the dynamic virtual rings formed by the token circulati...
متن کاملEvaluation of Token Based Mutual Exclusion Algorithms In Distributed Systems
This paper presents a framework for token based mutual exclusion algorithms in distributed systems. Their exists some traditional token based mutual exclusion algorithm. Some new algorithms are proposed in order to increase fault tolerance, minimize message complexity and decrease synchronization delay. In this paper, some new approaches are used, like Token ring algorithm with centralized appr...
متن کامل